A New Derandomization of Auctions
نویسندگان
چکیده
Let A be a randomized, unlimited supply, unit demand, single-item auction, which given a bid-vector b ∈ [h], has expected profit E[P (b)]. Aggarwal et al. showed that given A, there exists a deterministic auction which given a bid-vector b, guarantees a profit of E[P (b)]/4 − O(h). In this paper we show that given A, there exists a deterministic auction which given a bid-vector b of length n, guarantees a profit of E[P (b)]−O(h √ n ln hn). As is the case with the construction of Aggarwal et al., our construction is not polynomial time computable.
منابع مشابه
Hats, auctions and derandomization
We investigate derandomizations of digital good randomized auctions. We propose a general derandomization method which can be used to show that for every random auction there exists a deterministic auction having asymptotically the same revenue. In addition, we construct an explicit optimal deterministic auction for bi-valued auctions.
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملWhen Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complexity (KT), and show that it provides a useful tool for understanding advances in derandomization, and for putting various results in context. – To illustrate the usefulness of KT, by answering a question that has been posed...
متن کاملAchieving Simultaneous Spectrum Utilization and Revenue Improvements in Practical Wireless Spectrum Auctions
Spectrum is a valuable, scarce and finite natural resource that is needed for many different applications, so efficient use of the scarce radio spectrum is important for accommodating the rapid growth of wireless communications. Spectrum auctions are one of the best-known market-based solutions to improve the efficiency of spectrum use. However, Spectrum auctions are fundamentally differen...
متن کامل